<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/tree_algorithms/binarytree/binarytree_test.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('binarytree__test_8h.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a>  </div>
  <div class="headertitle">
<div class="title">binarytree_test.h File Reference</div>  </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include &quot;src/google_test/gtest.h&quot;</code><br />
<code>#include &quot;<a class="el" href="binarytree_8h_source.html">binarytree.h</a>&quot;</code><br />
<code>#include &quot;<a class="el" href="binarytreenode_8h_source.html">../binarytreenode/binarytreenode.h</a>&quot;</code><br />
<code>#include &lt;sstream&gt;</code><br />
</div>
<p><a href="binarytree__test_8h_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="class_binary_tree_test.html" title="BinaryTreeTest:测试类，用于为测试提供基础数据 ">BinaryTreeTest</a>:测试类，用于为测试提供基础数据  <a href="class_binary_tree_test.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ad232823b4358b06935529fab1c600de3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#ad232823b4358b06935529fab1c600de3">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_tree)</td></tr>
<tr class="memdesc:ad232823b4358b06935529fab1c600de3"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_tree:测试空树、非空树  <a href="#ad232823b4358b06935529fab1c600de3">More...</a><br /></td></tr>
<tr class="separator:ad232823b4358b06935529fab1c600de3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a22cc40ea8db4f5d34805f511619dfff3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#a22cc40ea8db4f5d34805f511619dfff3">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_inorder_walk)</td></tr>
<tr class="memdesc:a22cc40ea8db4f5d34805f511619dfff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_inorder_walk:测试树的中序遍历  <a href="#a22cc40ea8db4f5d34805f511619dfff3">More...</a><br /></td></tr>
<tr class="separator:a22cc40ea8db4f5d34805f511619dfff3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a440e046ae8fac09ca881f3a9e80c4e71"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#a440e046ae8fac09ca881f3a9e80c4e71">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_preorder_walk)</td></tr>
<tr class="memdesc:a440e046ae8fac09ca881f3a9e80c4e71"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_preorder_walk:测试树的前序遍历  <a href="#a440e046ae8fac09ca881f3a9e80c4e71">More...</a><br /></td></tr>
<tr class="separator:a440e046ae8fac09ca881f3a9e80c4e71"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac5df656308412011ed795e761c0ba7ab"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#ac5df656308412011ed795e761c0ba7ab">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_postorder_walk)</td></tr>
<tr class="memdesc:ac5df656308412011ed795e761c0ba7ab"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_postorder_walk:测试树的后序遍历  <a href="#ac5df656308412011ed795e761c0ba7ab">More...</a><br /></td></tr>
<tr class="separator:ac5df656308412011ed795e761c0ba7ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a93344246964f08775c477e99df8e0213"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#a93344246964f08775c477e99df8e0213">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_left_rotate)</td></tr>
<tr class="memdesc:a93344246964f08775c477e99df8e0213"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_left_rotate:测试树的左旋  <a href="#a93344246964f08775c477e99df8e0213">More...</a><br /></td></tr>
<tr class="separator:a93344246964f08775c477e99df8e0213"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5377352f5bcd00c7fe8c30c9bac3cd91"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#a5377352f5bcd00c7fe8c30c9bac3cd91">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_right_rotate)</td></tr>
<tr class="memdesc:a5377352f5bcd00c7fe8c30c9bac3cd91"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_right_rotate:测试树的右旋  <a href="#a5377352f5bcd00c7fe8c30c9bac3cd91">More...</a><br /></td></tr>
<tr class="separator:a5377352f5bcd00c7fe8c30c9bac3cd91"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad4f004637e8414b0d1ae2736dc4156ac"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="binarytree__test_8h.html#ad4f004637e8414b0d1ae2736dc4156ac">TEST_F</a> (<a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>, test_right_transplant)</td></tr>
<tr class="memdesc:ad4f004637e8414b0d1ae2736dc4156ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">test_right_transplant:测试树的剪切  <a href="#ad4f004637e8414b0d1ae2736dc4156ac">More...</a><br /></td></tr>
<tr class="separator:ad4f004637e8414b0d1ae2736dc4156ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Function Documentation</h2>
<a class="anchor" id="ad232823b4358b06935529fab1c600de3"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_tree&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_tree:测试空树、非空树 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00096">96</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="a22cc40ea8db4f5d34805f511619dfff3"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_inorder_walk&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_inorder_walk:测试树的中序遍历 </p>
<p>测试空树、非空树的中序遍历 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00106">106</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="a440e046ae8fac09ca881f3a9e80c4e71"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_preorder_walk&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_preorder_walk:测试树的前序遍历 </p>
<p>测试空树、非空树的前序遍历 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00129">129</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="ac5df656308412011ed795e761c0ba7ab"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_postorder_walk&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_postorder_walk:测试树的后序遍历 </p>
<p>测试空树、非空树的后序遍历 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00152">152</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="a93344246964f08775c477e99df8e0213"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_left_rotate&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_left_rotate:测试树的左旋 </p>
<p>测试空树、非空树的左旋 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00175">175</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="a5377352f5bcd00c7fe8c30c9bac3cd91"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_right_rotate&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_right_rotate:测试树的右旋 </p>
<p>测试空树、非空树的右旋 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00207">207</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
<a class="anchor" id="ad4f004637e8414b0d1ae2736dc4156ac"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TEST_F </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_binary_tree_test.html">BinaryTreeTest</a>&#160;</td>
          <td class="paramname">, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">test_right_transplant&#160;</td>
          <td class="paramname">&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>test_right_transplant:测试树的剪切 </p>
<p>测试空树、非空树的剪切 </p>

<p>Definition at line <a class="el" href="binarytree__test_8h_source.html#l00238">238</a> of file <a class="el" href="binarytree__test_8h_source.html">binarytree_test.h</a>.</p>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_2a06141a7764b24a0bfc3200068bd811.html">tree_algorithms</a></li><li class="navelem"><a class="el" href="dir_fd969146925b6d16f48b118241ca662a.html">binarytree</a></li><li class="navelem"><a class="el" href="binarytree__test_8h.html">binarytree_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
